Feature Extraction of 2-manifold Using Delaunay Triangulation
نویسندگان
چکیده
This paper is dedicated to a proposition of a novel feature extraction method for 2-manifold objects in 3D. The topological description was used as a base of the method. The curvatures of the surface are used to obtain the description independent on the position and the orientation of the object. In the addition, the Morse theory and the Delaunay triangulation are combined together to generate a final description that sufficiently identifies the object.
منابع مشابه
A Quick Image Registration Algorithm Based on Delaunay Triangulation
The traditional image matching algorithms adopt more complex strategies when dealing with mismatch caused by a lot of noise. In this paper, a simple, intuitive and effective noise processing algorithm is proposed based on Delaunay triangulation in computational geometry. The algorithm extracts feature points using SIFT method, respectively establishes Delaunay triangulation in multi-spectral an...
متن کاملFixed Points of the Restricted Delaunay Triangulation Operator
The restricted Delaunay triangulation can be conceived as an operator that takes as input a k-manifold (typically smooth) embedded in R and a set of points sampled with sufficient density on that manifold, and produces as output a k-dimensional triangulation of the manifold, the input points serving as its vertices. What happens if we feed that triangulation back into the operator, replacing th...
متن کامل5 A . 1 Meshing 3 D Domains Bounded by Piecewise Smooth Surfaces ∗
This paper proposes an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm may handle multivolume domains defined by non connected or non manifold surfaces. The boundary and subdivision surfaces are assumed to be described by a complex formed by surface patches stitched together along curve segments. The meshing algorithm is a Delaunay refinement and it uses the not...
متن کاملFacial Feature Location with Delaunay Triangulation/Voronoi Diagram Calculation
Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature extraction is still a filed to be explored. In this paper, an automatic extracting algorithm is developed to locate “key points” of facial features. The Delaunay Triangulation/Voronoi Diagram technique well known in comp...
متن کاملOn Voronoi-Delaunay Duality and Delaunay Meshes
In this paper, we are concerned with Delaunay triangulations of the vertex set of a piecewise flat (pwf) surface. We first propose the notion of well-formed Voronoi diagrams and establish a precise dual relationship between them and proper Delaunay triangulations on pwf surfaces. Then we provide an algorithm which, given any input manifold triangle mesh, constructs aDelaunay mesh: a manifold tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005